منابع مشابه
Testing Low-Degree Polynomials over
We describe an efficient randomized algorithm to test if a given binary function is a low-degree polynomial (that is, a sum of low-degree monomials). For a given integer and a given real , the algorithm queries at !" # points. If is a polynomial of degree at most , the algorithm always accepts, and if the value of has to be modified on at least an fraction of all inputs in order to transform it...
متن کاملClassifying polynomials and identity testing
One of the fundamental problems of computational algebra is to classify polynomials according to the hardness of computing them. Recently, this problem has been related to another important problem: Polynomial identity testing. Informally, the problem is to decide if a certain succinct representation of a polynomial is zero or not. This problem has been extensively studied owing to its connecti...
متن کاملCounting and Testing Dominant Polynomials
Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opin...
متن کاملOn testing the divisibility of lacunary polynomials by cyclotomic polynomials
An algorithm is described that determines whether a given polynomial with integer coefficients has a cyclotomic factor. The algorithm is intended to be used for sparse polynomials given as a sequence of coefficientexponent pairs. A running analysis shows that, for a fixed number of nonzero terms, the algorithm runs in polynomial time.
متن کاملPrime Values of Polynomials and Irreducibility Testing
In 1857 Bouniakowsky [6] made a conjecture concerning prime values of polynomials that would, for instance, imply that x + 1 is prime for infinitely many integers x. Let ƒ (x) be a polynomial with integer coefficients and define the fixed divisor of ƒ, written d(ƒ), as the largest integer d such that d divides f(x) for all integers x. Bouniakowsky conjectured that if f(x) is nonconstant and irr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1990
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(08)80033-8